Finite Commutative Rings with a MacWilliams Type Relation for the m-Spotty Hamming Weight Enumerators
نویسنده
چکیده
Let R be a finite commutative ring. We prove that a MacWilliams type relation between the m-spotty weight enumerators of a linear code over R and its dual hold, if and only if, R is a Frobenius (equivalently, Quasi-Frobenius) ring, if and only if, the number of maximal ideals and minimal ideals of R are the same, if and only if, for every linear code C over R, the dual of the dual C is C itself. Also as an intermediate step, we present a new and simpler proof for the commutative case of Wood’s theorem which states that R has a generating character if and only if R is a Frobenius ring.
منابع مشابه
MacWilliams type identities for some new $m$-spotty weight enumerators over finite commutative Frobenius rings
Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an m-spotty byte error, which can be effectively detected or corrected using byte errorcontrol codes. The MacWilliams identity provides the relationship between the weight distribution of a code and...
متن کاملMacWilliams Type identities for $m$-spotty Rosenbloom-Tsfasman weight enumerators over finite commutative Frobenius rings
The m-spotty byte error control codes provide a good source for detecting and correcting errors in semiconductor memory systems using high density RAM chips with wide I/O data (e.g. 8, 16, or 32 bits). m-spotty byte error control codes are very suitable for burst correction. M. Özen and V. Siap [7] proved a MacWilliams identity for the m-spotty Rosenbloom-Tsfasman (shortly RT) weight enumerator...
متن کاملMacWilliams identities for m-spotty weight enumerators of codes over rings
Computer memory systems using high-density RAM chips are vulnerable to m-spotty byte errors when they are exposed to high-energy particles. These errors can be effectively detected or corrected using (m-spotty) byte error-control codes. In order to study the properties of these codes and to measure their error-detection and error-correction performance, m-spotty weight enumerators are introduce...
متن کاملMacWilliams identities for poset level weight enumerators of linear codes
Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have been considered. Recently, codes over poset metrics have been studied. Poset metric is a great generalization of many metrics especially the well-known ones such as the RT and the Hamming metrics. Poset metric can be realized on the channels with localized error occurrences. It has been shown that MacWilliams identities...
متن کاملA MacWilliams type identity for m-spotty generalized Lee weight enumerators over Zq q
Burst errors are very common in practice. There have been many designs in order to control and correct such errors. Recently, a new class of byte error control codes called spotty byte error control codes has been specifically designed to fit the large capacity memory systems that use highdensity random access memory (RAM) chips with input/output data of 8, 16, and 32 bits. The MacWilliams iden...
متن کامل